Runtime analysis of evolutionary algorithms via symmetry arguments

We use an elementary argument building on group actions to prove that the selection-free steady state genetic algorithm analyzed by Sutton and Witt (GECCO 2019) takes expected number of $\Omega(2^n / \sqrt n)$ iterations find any particular target search point. This bound is valid for all population sizes $\mu$. Our result improves over previous lower $\Omega(\exp(n^{\delta/2}))$ $\mu = O(n^{1/2 - \delta})$, $0 < \delta 1/2$.